A Distributed Blocking Flowshop Scheduling with Setup Times Using Multi-Factory Collaboration Iterated Greedy Algorithm

As multi-factory production models are more widespread in modern manufacturing systems, a distributed blocking flowshop scheduling problem (DBFSP) is studied which no buffer between adjacent machines and setup time constraints considered. To address the above problem, mixed integer linear programming (MILP) model first constructed, its correctness verified. Then, an iterated greedy-algorithm-blending collaboration mechanism (mIG) presented to optimize makespan criterion. In mIG algorithm, rapid evaluation method designed reduce complexity, two different iterative processes selected by certain probability. addition, collaborative interactions cross-factory inner-factory considered further improve exploitation exploration of mIG. Finally, 270 tests showed that average RPI values 1.93% 78.35% better than five comparison algorithms on average, respectively. Therefore, suitable solve DBFSP_SDST.